Dynamic consequence for soft information

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic consequence for soft information

This article looks at so-called dynamic consequence relations for models of soft information change. We provide a sound, complete calculus for one-step soft dynamic consequence relations. We then study a generalization to sequences of updates, for which we show a number of valid and invalid structural rules.

متن کامل

Dynamic vs. Classical Consequence

The shift of interest in logic from just reasoning to all forms of information flow has considerably widened the scope of the discipline, as amply illustrated in Johan van Benthem’s recent book Logical Dynamics of Information and Interaction. But how much does this change when it comes to the study of traditional logical notions such as logical consequence? We propose a systematic comparison be...

متن کامل

Dynamic Bayesian Information Measures

This paper introduces measures of information for Bayesian analysis when the support of data distribution is truncated progressively. The focus is on the lifetime distributions where the support is truncated at the current age t>=0. Notions of uncertainty and information are presented and operationalized by Shannon entropy, Kullback-Leibler information, and mutual information. Dynamic updatings...

متن کامل

Dynamic Consequence and Public announcement

In [25] van Benthem proposes a dynamic consequence relation defined as ψ1, . . . , ψn |= φ iff |= [ψ1]...[ψn]φ, where the latter denotes consequence in public announcement logic, a dynamic epistemic logic. In this paper we investigate the structural properties of a conditional dynamic consequence relation |=Γ extending van Benthem’s proposal. It takes into account a set of background conditions...

متن کامل

Information Algebras and Consequence Operators

We explore a connection between different ways of representing information in computer science. We show that relational databases, modules, algebraic specifications and constraint systems all satisfy the same ten axioms. A commutative semigroup together with a lattice satisfying these axioms is then called an “information algebra”. We show that any compact consequence operator satisfying the in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logic and Computation

سال: 2014

ISSN: 0955-792X,1465-363X

DOI: 10.1093/logcom/exu040